The domination game played on diameter 2 graphs
نویسندگان
چکیده
منابع مشابه
Paired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملThe domination game played on unions of graphs
In a graph G, a vertex is said to dominate itself and its neighbors. The Domination game is a two player game played on a finite graph. Players alternate turns in choosing a vertex that dominates at least one new vertex. The game ends when no move is possible, that is when the set of chosen vertices forms a dominating set of the graph. One player (Dominator) aims to minimize the size of this se...
متن کاملTotal Domination in Graphs with Diameter 2
The total domination number γt (G) of a graph G is the minimum cardinality of a set S of vertices, so that every vertex of G is adjacent to a vertex in S. In this article, we determine an optimal upper bound on the total domination number of a graph with diameter 2. We show that for every graph G on n vertices with diameter 2, γt (G) ≤ 1 + √ n ln(n). This bound is optimal in the sense that give...
متن کاملOn the diameter of domination bicritical graphs
For a graph G, we let γ(G) denote the domination number of G. A graph G is said to be k-bicritical if γ(G) = k and γ(G − {x, y}) < k for any two vertices x, y ∈ V (G). Brigham et al. [Discrete Math. 305 (2005), 18–32] conjectured that the diameter of a connected k-bicritical graph is at most k − 1. However, in [Australas. J. Combin. 53 (2012), 53–65], counterexamples of the conjecture for k = 4...
متن کاملDomination games played on line graphs of complete multipartite graphs
The domination game on a graph G (introduced by B. Brešar, S. Klavžar, D.F. Rall [1]) consists of two players, Dominator and Staller, who take turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay this process as much as po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2021
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-021-00786-x